László Móczár is 100

Hit - and - Run is Fast and Fun 1 László

The hit-and-run algorithm is one of the fastest known methods to generate a random point in a high dimensional convex set. In this paper we study a natural extension of the hit-and-run algorithm to sampling from a logconcave distribution in n dimensions. After appropriate preprocessing, hit-and-run produces a point from approximately the right distribution in amortized time O * (n 3).

Graph Minor Theory László

A monumental project in graph theory was recently completed. The project, started by Robertson and Seymour, and later joined by Thomas, led to entirely new concepts and a new way of looking at graph theory. The motivating problem was Kuratowski’s characterization of planar graphs, and a far-reaching generalization of this, conjectured by Wagner: If a class of graphs is minor-closed (i.e., it is...

Transition and Development László Csaba

Albert - László Barabási from Network Structure

W e are surrounded by complex systems, from cells made of thousands of molecules to society, a collection of billions of interacting individuals. These systems display signatures of order and self-organization. Understanding and quantifying this complexity is a grand challenge for science. Kinetic theory, developed at the end of the 19th century, shows that the measurable properties of gases, f...

Albert - László Barabási from Network Structure

W e are surrounded by complex systems, from cells made of thousands of molecules to society, a collection of billions of interacting individuals. These systems display signatures of order and self-organization. Understanding and quantifying this complexity is a grand challenge for science. Kinetic theory, developed at the end of the 19th century, shows that the measurable properties of gases, f...